Separating k-separated eNCE graph languages
نویسندگان
چکیده
منابع مشابه
Separating k-Separated eNCE Graph Languages
Kim, C. and D.H. Lee, Separating k-separated eNCE graph languages, Theoretical Computer Science 120 (1993) 247-259. An eNCE graph grammar is k-separated (k > 1) if the distance between any two nonterminal nodes in any of its sentential forms is at least k. Let SEP, denote the class of graph languages generated by SEPl (SEP2) is the class of eNCE (boundar E) graph languages, Recently, Engelfriet...
متن کاملEmptiness Problems of eNCE Graph Languages
We consider the complexity of the emptiness problem for various classes of graph languages deened by eNCE (edge label neighborhood controlled embedding) graph grammars. In particular, we show that the emptiness problem is undecidable for general eNCE graph grammars, DEXPTIME-complete for connuent and boundary eNCE graph grammars, PSPACE-complete for linear eNCE graph grammars, NL-complete for d...
متن کاملInference of k-Testable Directed Acyclic Graph Languages
In this paper, we tackle the task of graph language learning. We first extend the well-known classes of k-testability and k-testability in the strict sense languages to directed graph languages. Second, we propose a graph automata model for directed acyclic graph languages. This graph automata model is used to propose a grammatical inference algorithm to learn the class of directed acyclic k-te...
متن کاملSeparating Graph Logic from MSO
Graph logic (GL) is a spatial logic for querying graphs introduced by Cardelli et al. It has been observed that in terms of expressive power, this logic is a fragment of Monadic Second Order Logic (MSO), with quantification over sets of edges. We show that the containment is proper by exhibiting a property that is not GL definable but is definable in MSO, even in the absence of quantification o...
متن کاملThe Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars
A graph grammar is called non-obstructing if each graph G derivable from the axiom can derive a terminal graph. In this paper, the bounded degree problem for non-obstructing eNCE graph grammars is proved to be in the complexity class NL.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90290-a